Attacks on Karlsson and Mitrokotsa's Grouping-Proof-Distance-Bounding Protocol
نویسندگان
چکیده
In the recent IEEE communication letter “Grouping-ProofDistance-Bounding Protocols: Keep All Your Friends Close” by Karlsson and Mitrokotsa, a protocol for grouping-proof distance-bounding (GPDB) is proposed. In this letter, we show that the proof that is generated by the proposed GBDP protocol does not actually prove anything. Furthermore, we provide a construction towards a distance-bounding grouping-proof, however it remains unclear if one can ever truly combine (privacy-preserving) distance-bounding and a grouping-proof. As a bonus, we also discuss IEEE communication letters’ poor standards regarding scientific ethics and responsibility.
منابع مشابه
Grouping-Proof Protocol for RFID Tags: Security Definition and Scalable Construction
In this paper, we propose a grouping-proof protocol for RFID tags based on secret sharing. Our proposed protocol addresses the scalability issue of the previous protocols by removing the need for an RFID reader to relay messages from one tag to another tag. We also present a security model for a secure grouping-proof protocol which properly addresses the so called mafia fraud atttack. Mafia fra...
متن کاملScalable Grouping-proof Protocol for RFID Tags
In this paper, we propose a grouping-proof protocol for RFID tags based on (n, n)-secret sharing. Our proposed protocol addresses the scalability issue of the previous protocols by removing the need for an RFID reader to relay messages from one tag to another tag. We also present a security model for a secure grouping-proof protocol which properly addresses the so called mafia fraud attack (som...
متن کاملMaa Fraud Attacks over Noisy Channels
Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, maa fraud and terrorist fraud attacks. Reid et al. proposed the rst symmetric key distance bounding protocol against maa and terrorist fraud attacks [1]. However, [2] claims that this is only achieved with a (7/8) probability of success for maa fraud, rather than the theoretical value...
متن کاملSecurity Analysis of the Distance Bounding Protocol Proposed by Jannati and Falahati
In this paper, the security of a distance bounding protocol is analyzed which has been recently proposed by Jannati and Falahati (so-called JF). We prove that an adversary can recover key bits of JF protocol with probability of “1” while the complexity of attack is “2n” runs of protocol. In addition, we propose an improved protocol and prove that the improved protocol is resistant to mafia frau...
متن کاملDesign of a secure distance-bounding channel for RFID
Distance bounding is often proposed as a countermeasure to relay attacks and distance fraud in RFID proximity identification systems. Although several distance-bounding protocols have been proposed the security of these proposals are dependent on the underlying communication channel. Conventional communication channels have been shown to be inappropriate for implementing distance bounding, as t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017